A measurement driven analog of adiabatic quantum computation for frustration-free Hamiltonians
نویسندگان
چکیده
Liming Zhao, 2 Carlos A. Pérez-Delgado, Simon C. Benjamin, and Joseph F. Fitzsimons 2, ∗ Singapore University of Technology and Design, 8 Somapah Road, Singapore 487372 Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 School of Computing, University of Kent, Canterbury CT2 7NF, United Kingdom Department of Materials, University of Oxford, Parks Rd, Oxford OX1 3PH, United Kingdom
منابع مشابه
Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices
We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is Quantum-MerlinArthur-complete (QMA-complete). We also show that finding the highest energy of a stoquastic Hamiltonian is QMA-complete and that adiabatic quantum computation using certain excited states of a stoquastic Hamiltonian is universal. We also show that adiabatic evolution in the ground state of a st...
متن کاملGapped two-body Hamiltonian for continuous-variable quantum computation.
We introduce a family of Hamiltonian systems for measurement-based quantum computation with continuous variables. The Hamiltonians (i) are quadratic, and therefore two body, (ii) are of short range, (iii) are frustration-free, and (iv) possess a constant energy gap proportional to the squared inverse of the squeezing. Their ground states are the celebrated Gaussian graph states, which are unive...
متن کاملAdiabatic quantum optimization with the wrong Hamiltonian
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement these Hamiltonians will be imperfect and limited in its precision. Even small perturbations and imprecisions can have profound effects on the nature of the ...
متن کاملRealizable Hamiltonians for Universal Adiabatic Quantum Computers
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists ...
متن کاملQuantum speedup in stoquastic adiabatic quantum computation
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation have been investigated to show quantum computational supremacy. At a commercial side, quantum annealing machine realizes the quantum Ising model with a transver...
متن کامل